home *** CD-ROM | disk | FTP | other *** search
- *** 1.6 1992/11/08 00:38:51
- --- PatchLev.h 1992/12/28 07:29:24
- ***************
- *** 1,5 ****
-
- ! #define PatchLevel "8"
-
- /*
- * the Patch Level above is to identify the version
- --- 1,5 ----
-
- ! #define PatchLevel "9"
-
- /*
- * the Patch Level above is to identify the version
- *** 1.3 1992/07/21 14:47:55
- --- expected.out 1992/12/28 07:29:25
- ***************
- *** 647,649 ****
- --- 647,698 ----
- 1.1 = 1
- .7 + .5 = -0.8
- -.5 - .7 = 0.8
- + prepending...
- + a: 9 8 7 6 5 4 3 2 1 0
- + appending...
- + a: 9 8 7 6 5 4 3 2 1 0 0 1 2 3 4 5 6 7 8 9
- + b = a:
- + 9 8 7 6 5 4 3 2 1 0 0 1 2 3 4 5 6 7 8 9
- + remove_front of first 10 elements:
- + b: 0 1 2 3 4 5 6 7 8 9
- + inserting 100 after sixth element...
- + b: 0 1 2 3 4 5 100 6 7 8 9
- + after a.join(b)
- + 9 8 7 6 5 4 3 2 1 0 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 100 6 7 8 9
- + b:
- +
- + b:
- + 999
- + bb:
- + 999
- + prepending...
- + a:
- + 9 8 7 6 5 4 3 2 1 0
- + appending...
- + a: 9 8 7 6 5 4 3 2 1 0 0 1 2 3 4 5 6 7 8 9
- + b = a: 9 8 7 6 5 4 3 2 1 0 0 1 2 3 4 5 6 7 8 9
- + remove_front of first 10 elements:
- + b: 0 1 2 3 4 5 6 7 8 9
- + inserting 100 after sixth element...
- + b: 0 1 2 3 4 5 100 6 7 8 9
- + after aa = a; aa.join(b)
- + 9 8 7 6 5 4 3 2 1 0 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 100 6 7 8 9
- + b:
- +
- + b:
- + 999
- + bb:
- + 999
- + z = a: 9 8 7 6 5 4 3 2 1 0 0 1 2 3 4 5 6 7 8 9
- + remove_rear of last 10 elements:
- + z: 9 8 7 6 5 4 3 2 1 0
- + inserting 100 before alternate elements...
- + z: 100 9 100 8 100 7 100 6 100 5 100 4 100 3 100 2 100 1 100 0
- + inserting 200 after sixth element...
- + z: 100 9 100 8 100 7 200 100 6 100 5 100 4 100 3 100 2 100 1 100 0
- + deleting alternate elements of z...100 100 100 200 6 5 4 3 2 1 0
- + z: 9 8 7 100 100 100 100 100 100 100
- + z in reverse order:
- + 100 100 100 100 100 100 100 7 8 9
- +
- + End of test
- *** 1.3 1992/06/03 01:55:31
- --- makefile.32 1992/12/28 07:29:25
- ***************
- *** 40,46 ****
- # test targets
- TEST= tbitset.ttp tbitstri.ttp tcomplex.ttp tfile.ttp tfix.ttp tfix16.ttp \
- tfix24.ttp tgetopt.ttp tinteger.ttp tobstack.ttp trandom.ttp trationa.ttp \
- ! tstring.ttp
-
- # the stuff to make
- ALL= $(TEST)
- --- 40,46 ----
- # test targets
- TEST= tbitset.ttp tbitstri.ttp tcomplex.ttp tfile.ttp tfix.ttp tfix16.ttp \
- tfix24.ttp tgetopt.ttp tinteger.ttp tobstack.ttp trandom.ttp trationa.ttp \
- ! tstring.ttp tillist.ttp
-
- # the stuff to make
- ALL= $(TEST)
- ***************
- *** 76,81 ****
- --- 76,82 ----
- trandom.ttp: trandom.o
- trationa.ttp: trationa.o
- tstring.ttp: tstring.o
- + tillist.ttp: tillist.o
-
- # ah, the pleasures of single pass linking!
- tcomplex.ttp: tcomplex.o
- *** 1.1 1992/03/22 21:15:45
- --- test32.g 1992/12/28 07:29:27
- ***************
- *** 40,45 ****
- --- 40,48 ----
- echo tstring
- .\tstring.ttp <tstring.inp >tstring.out
-
- + echo tiLList
- + .\tillist.ttp >tillist.out
- +
- # now put it all together
- #
- echo tfile >out
- ***************
- *** 66,68 ****
- --- 69,73 ----
- cat tfix16.out >>out
- echo tfix24 >>out
- cat tfix24.out >>out
- + echo tillist >>out
- + cat tillist.out >>out
- *** 1.1 1992/03/22 21:15:45
- --- tinteger.cc 1992/12/28 07:29:30
- ***************
- *** 375,380 ****
- --- 375,398 ----
- longaccumtest(fact28, 10000000, 100000000);
- }
-
- + void modtest()
- + {
- + Integer b, e, m;
- +
- + m = 1; m <<= 32;
- + b = m + 1;
- +
- + e = Ipow( 2, 32 );
- + b = Ipow( 2, 32 ); // use b as a comparison
- + cout << "2^32 = " << e << "\n";
- +
- + e %= (e-1); // do same op two ways...
- + b = b % (b - 1);
- +
- + cout << "2^32 % (2^32-1) = " << e << "\n"; // e is incorrect here
- + cout << "2^32 % (2^32-1) = " << b << "\n"; // but b is ok
- + }
- +
- main()
- {
- Integer one = 1;
- ***************
- *** 392,397 ****
- --- 410,416 ----
- fibtest();
- anothertest();
- iotest();
- + modtest();
-
- cout << "\nEnd of test\n";
- }
- *** 1.1 1992/03/22 21:15:45
- --- tobstack.cc 1992/12/28 07:29:30
- ***************
- *** 25,31 ****
- Obstack os;
- char c;
-
- ! s[n++] = os.copy("\nunique words:");
- assert(os.OK());
- assert(os.contains(s[0]));
-
- --- 25,31 ----
- Obstack os;
- char c;
-
- ! s[n++] = (char *)os.copy("\nunique words:");
- assert(os.OK());
- assert(os.contains(s[0]));
-
- ***************
- *** 40,46 ****
- }
- else if (got_one)
- {
- ! char* current = os.finish(0);
- for (int i = 0; i < n; ++i) // stupid, but this is only a test.
- {
- if (strcmp(s[i], current) == 0)
- --- 40,46 ----
- }
- else if (got_one)
- {
- ! char* current = (char *)os.finish(0);
- for (int i = 0; i < n; ++i) // stupid, but this is only a test.
- {
- if (strcmp(s[i], current) == 0)
-